Pseudorandom number generation and space complexity

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pseudorandom Number Generation and Space Complexity

Recently, Blum and Micali (1982) described a pseudorandum number generator that transforms m-bit seeds to ink-bit pseudorandom numbers, for any integer k. Under the assumption that the discrete logarithm problem cannot be solved by polynomial-size combinational logic circuits, they show that the pseudorandom numbers generated are good in the sense that no polynomial-size circuit can determine t...

متن کامل

Parallel Pseudorandom Number Generation

Monte Carlo applications are widely perceived as embarrassingly parallel. (Monte Carlo enthusiasts prefer the term “naturally parallel” to the somewhat derogatory “embarrassingly parallel” coined by computer scientists.) The truth of this notion depends, to a large extent, on the quality of the parallel random number generators used. It is widely assumed that with N processors executing N copie...

متن کامل

Pseudorandom Number Generation: Impossibility and Compromise

Pseudorandom number generators are widely used in the area of simulation. Defective generators are still widely used in standard library programs, although better pseudorandom number generators such as the Mersenne Twister are freely avail-

متن کامل

Layered Cellular Automata for Pseudorandom Number Generation

The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. The time-varying L-LCA transformation at each clock can be reduced to a single transformation in the set { | 1, 2, , 2 1} f n A f = − ... formed by the transformation matrix A of a maximum length Cellular Automata ...

متن کامل

Some Methods of Parallel Pseudorandom Number Generation

We detail several methods used in the production of pseudorandom numbers for scalable systems. We will focus on methods based on parameterization, meaning that we will not consider splitting methods. We describe parameterized versions of the following pseudorandom number generation: 1. linear congruential generators 2. linear matrix generators 3. shift-register generators 4. lagged-Fibonacci ge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1985

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(85)80043-7